Incremental construction of minimal deterministic finite cover automata
نویسندگان
چکیده
منابع مشابه
Incremental construction of minimal deterministic finite cover automata
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal DFA for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the...
متن کاملAn Incremental Algorithm for Minimal Deterministic Finite Cover Automata
A fast incremental algorithm for constructing minimal DFCA for a given language is presented. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this techniques seems to be the best choice for incrementally building the automaton for a large language especially when the number of states in the DFCA is significantly less than the number of states in the “e...
متن کاملNon-Deterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language using a Non-deterministic Finite Automata (NFA) may significantly reduce the number of required states. The combined power of the succinctness of the representation of fin...
متن کاملIncremental construction of minimal acyclic finite-state automata
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finitestate automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We prese...
متن کاملIncremental Construction Of Minimal Acyclic Finite State Automata And Transducers
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite state automata and transducers. Traditional methods consist of two steps. The first one is to construct atrie, the second one -to perform minimization. Our approach is to construct an automaton in a single step by adding new strings one by one and minimizing the resulting automaton on-the-fly. We pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.020